Secure Multicast Communication Using Group Based Multicast Hierarchy

نویسندگان

  • R. Varalakshmi
  • V. Rhymend Uthariaraj
چکیده

Secure multicast communication is a significant requirement in emerging applications in adhoc environments like military or public emergency network applications. Membership dynamism is a major challenge in providing complete security in such networks. This paper proposes a efficient Group Based Multicast Hierarchy (GBMH) algorithm for secret multicast communication, in which source nodes used the Secure Ad hoc On Demand Distance Vector (SAODV) protocol is an extension of the AODV protocol. The Secure AODV scheme is based on the assumption that each node possesses certified public keys of all network nodes. The SAODV protocol collects its 1 hop neighbours to form group. This protocol sends acknowledgement for each transmission in order to reduce the retransmission. Membership dynamism was overcome by electing local controllers and with periodic updates of node join and leave information using multicast hierarchy. The performance is studied in terms of average end to end delay and fault tolerance in multicast transmission. Keywords— Secure Multicast Communication, Adhoc environments, Membership Dynamism, GBMH, SAODV

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotically Optimal Tree-based Group Key Management Schemes

In key management schemes that realize secure multicast communications encrypted by group keys on a public network, tree structures are often used to update the group keys efficiently. Selçuk and Sidhu have proposed an efficient scheme which updates dynamically the tree structures based on the withdrawal probabilities of members. In this paper, it is shown that Selçuk-Sidhu scheme is asymptotic...

متن کامل

Row/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips

In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...

متن کامل

Efficient Group Key Management Schemes for Multicast Dynamic Communication Systems

Key management in multicast dynamic groups, where users can leave or join at their ease is one of the most crucial and essential part of secure communication. Various efficient management strategies have been proposed during last decade that aim to decrease encryption costs and transmission overheads. In this report, two different types of key management schemes are proposed. First proposed sch...

متن کامل

A Scalable and Distributed Security Protocol for Multicast Communications

In this paper, we propose an efficient and a scalable protocol for secure multicast communication. This protocol is based on the Iolus and the logical key hierarchy protocols. It divides the whole group into several subgroups as in the Iolus protocol. Each subgroup in turn is organized in a logical key hierarchy as in the LKH protocol. This decomposition reduces the complexity for a member join...

متن کامل

Scalable secure one-to-many group communication using dual encryption

Multicasting is a scalable solution for group communication. Whereas secure unicast is a well-understood problem, scalable secure multicast poses several unique security problems, namely groupmembership control, scalable key distribution to a dynamic group. We address scalability in the pro-posed protocol by using hierarchical subgrouping. Third party hosts or members of the mul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012